Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
🔗 Graph Algorithms
Shortest Path, Network Flow, Graph Traversal, Topological Sort
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
122816
posts in
35.2
ms
Shortest
Paths in
Geodesic
Unit-Disk Graphs
📐
Computational Geometry
arxiv.org
·
6d
·
…
Training State of the Art
Vulnerability
Discovery Agents through
Reinforcement
Learning
🛡️
AI Security
depthfirst.com
·
2d
·
Hacker News
·
…
2026 Masters
DFS
picks, lineups, field, advice: Optimal PGA Tour predictions, strategy on
FanDuel
, DraftKings
📇
Index Selection
cbssports.com
·
3h
·
…
LangDrained
: Path traversal, SQL injection, and
Deserialization
of untrusted data in LangChain
🔗
Intrusive Containers
cyera.com
·
2d
·
Hacker News
,
r/netsec
·
…
A $0 graph
traversal
outperforms GPT-5.2 at finding bugs in
PRs
📊
Criterion.rs
therohansharma.com
·
5d
·
Hacker News
·
…
~1ms hybrid graph + vector queries (network is now the bottleneck) ·
orneryd
NornicDB
📊
Vectorized Query Execution
github.com
·
6d
·
r/golang
·
…
smolnets
within
behemoths
🔗
Intrusive Containers
imperfect.bearblog.dev
·
5d
·
…
Community Shaping in the Digital Age: A Risk‐Focused Temporal Fusion Framework for
Analyzing
Information Diffusion and
Fragmentation
in Online Social Networks
📡
RSS
onlinelibrary.wiley.com
·
6d
·
…
A gentle tutorial and a structured
reformulation
of
Bock
's algorithm for minimum directed spanning trees
🕸️
Graph Theory
arxiv.org
·
2d
·
…
Decoupling
Geometric
Planning and Execution in Scalable Multi-Agent Path Finding
📐
Computational Geometry
arxiv.org
·
2d
·
…
Large Neighborhood Search for Multi-Agent Task
Assignment
and Path Finding with
Precedence
Constraints
💃
Dancing Links
arxiv.org
·
1d
·
…
MeshTailor
: Cutting
Seams
via Generative Mesh Traversal
📐
Computational Geometry
arxiv.org
·
2d
·
…
Embeddings
of
Nation-Level
Social Networks
🧮
Embeddings
arxiv.org
·
1d
·
…
Codebase-Memory
:
Tree-Sitter-Based
Knowledge Graphs for LLM Code Exploration via MCP
🌳
Tree-sitter
arxiv.org
·
2d
·
…
Bounded
Independence Edge Sampling for
Combinatorial
Graph Properties
🕸️
GraphBLAS
arxiv.org
·
6d
·
…
Universe Reduction for
APSP
: Equivalence of Three Fine-Grained
Hypotheses
🔍
Type Inference
arxiv.org
·
2d
·
…
From Pixels to
BFS
: High Maze Accuracy Does Not
Imply
Visual Planning
🔲
Cellular Automata
arxiv.org
·
2d
·
…
CTS-PLL
: A Robust and Anytime Framework for Collaborative Task Sequencing and Multi-Agent Path Finding
🚦
Wait-Free Algorithms
arxiv.org
·
6d
·
…
Improved Algorithms for
Unrelated
Crowd Worker
Scheduling
in Mobile Social Networks
📦
Folly
arxiv.org
·
3d
·
…
A
Sc2C2
@
C88
cluster based ultra-compact multi-level probabilistic bit for matrix multiplication
🎴
SIMD Shuffles
arxiv.org
·
3d
·
…
Loading...
Loading more...
Page 2 »
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help